A Nonmonotonic Delegation Logic with Prioritized Conflict Handling
نویسندگان
چکیده
We extend previous work on Delegation Logic (DL) [11, 12], a tractable and practically implementable logic-based language for authorization in large-scale, open, distributed systems. We expressively generalize the previous version of DL (called D1LP) to have nonmonotonic expressive features, including negation-as-failure, classical negation, and prioritized conflict handling. The resulting formalism is called D2LP. We discuss the motivations and usefulness of prioritized conflict handling and some subtleties and challenges in extending DL to have it. Partly because of these subtleties, in this paper we restrict D2LP by prohibiting queries about delegation statements. Our technical approach to defining D2LP is based on tractably compiling a D2LP into a Generalized Courteous LP (GCLP) [7, 8], which is in turn tractably compiled into an Ordinary LP (OLP). We show that D2LP is thus tractable and practically implementable on top of existing technologies for OLP, e.g., Prolog, SQL databases, and other rule-based systems.
منابع مشابه
A Logic-based Knowledge Representation for Authorization with Delegation
We introduce Delegation Logic (DL), a logic-based knowledge representation (i.e., language) that deals with authorization in large-scale, open, distributed systems. Of central importance in any system for deciding whether requests should be authorized in such a system are delegation of authority, negation of authority, and conflicts between authorities. DL’s approach to these issues and to the ...
متن کاملA Four-valued Approach for Handling Inconsistency in Prioritized Knowledge-bases
The use of priorities among formulae is an important tool to appropriately revise inconsistent knowledge-bases. We present a four-valued semantical approach for recovering consistent data from prioritized knowledge-bases. This approach is nonmonotonic and paraconsistent in nature.
متن کاملFour-valued Logics for Reasoning with Uncertainty in Prioritized Data
We present an approach for drawing plausible conclusions from inconsistent and incomplete knowledge-bases, which may also be prioritized. Our method is based on a four-valued semantics that is particularly suitable for reasoning with uncertainty. Our inference mechanism is closely related to some other well-known formalisms for handling inconsistent data, such as reasoning with maximal consiste...
متن کاملIbm Research Report a Logic-based Knowledge Representation for Authorization with Delegation
We introduce Delegation Logic (DL), a logic-based knowledge representation (i.e., language) that deals with authorization in large-scale, open, distributed systems. Of central importance in any system for deciding whether requests should be authorized in such a system are delegation of authority, negation of authority, and con icts between authorities. DL's approach to these issues and to the i...
متن کاملPreference-Based Argumentation Handling Dynamic Preferences Built on Prioritized Logic Programming
To treat dynamic preferences correctly is crucially required in the fields of argumentation as well as nonmonotonic reasoning. To meet such requirements, first, we propose a hierarchical Prioritized Logic Program (or a hierarchical PLP, for short), which enhances the formalism of Sakama and Inoue’s PLP so that it can represent and reason about dynamic preferences. Second, using such a hierarchi...
متن کامل